Analog Computer Understanding of Hamiltonian Paths

This paper explores finding the number nh of undirected hamiltonian paths in an undirected graph G = (V,E) using lumped/ideal circuits, specifically low-pass filters. Ideal analog computation allows one to computer nh in a short period of time, but in practice, precision problems disturb this ideal nature. A digital/algorithmic approach is proposed, and then it is shown that the approach/method operates under theoretically feasible (polynomial) time: O(n), where n = |V |.